Parameterized complexity

Results: 172



#Item
31Minicourse on parameterized algorithms and complexity Part 5: Treewidth Dániel Marx Jagiellonian University in Kraków

Minicourse on parameterized algorithms and complexity Part 5: Treewidth Dániel Marx Jagiellonian University in Kraków

Add to Reading List

Source URL: www.cs.bme.hu

Language: English - Date: 2015-04-22 03:49:11
    32Improving local search using parameterized complexity ´ Daniel Marx Budapest University of Technology and Economics

    Improving local search using parameterized complexity ´ Daniel Marx Budapest University of Technology and Economics

    Add to Reading List

    Source URL: www.cs.bme.hu

    Language: English - Date: 2008-12-10 12:51:14
      33Some New Directions and Questions in Parameterized Complexity Rodney G. Downey1 and Catherine McCartin2 1 2

      Some New Directions and Questions in Parameterized Complexity Rodney G. Downey1 and Catherine McCartin2 1 2

      Add to Reading List

      Source URL: www.mcs.vuw.ac.nz

      Language: English - Date: 2005-02-12 02:40:06
        34On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties? Pinar Heggernes1 , Pim van ’t Hof1 , D´aniel Marx2 , Neeldhara Misra3 , and Yngve Villanger1 2

        On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties? Pinar Heggernes1 , Pim van ’t Hof1 , D´aniel Marx2 , Neeldhara Misra3 , and Yngve Villanger1 2

        Add to Reading List

        Source URL: www.cs.bme.hu

        Language: English - Date: 2014-01-01 07:56:54
          35Survey of connections between approximation algorithms and parameterized complexity Dániel Marx Tel Aviv University, Israel Operations Research Seminar, Technion, Haifa, Israel

          Survey of connections between approximation algorithms and parameterized complexity Dániel Marx Tel Aviv University, Israel Operations Research Seminar, Technion, Haifa, Israel

          Add to Reading List

          Source URL: www.cs.bme.hu

          Language: English - Date: 2010-01-19 06:09:57
            36Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask) Dániel Marx Institute for Computer Science and Control,

            Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask) Dániel Marx Institute for Computer Science and Control,

            Add to Reading List

            Source URL: www.cs.bme.hu

            Language: English - Date: 2014-07-09 06:13:26
              37Parameterized complexity of constraint satisfaction problems ´ Daniel Marx Budapest University of Technology and Economics

              Parameterized complexity of constraint satisfaction problems ´ Daniel Marx Budapest University of Technology and Economics

              Add to Reading List

              Source URL: www.cs.bme.hu

              Language: English - Date: 2007-10-29 10:13:45
                38Parameterized complexity of constraint satisfaction problems ´ Daniel Marx Budapest University of Technology and Economics

                Parameterized complexity of constraint satisfaction problems ´ Daniel Marx Budapest University of Technology and Economics

                Add to Reading List

                Source URL: www.cs.bme.hu

                Language: English - Date: 2007-10-29 10:13:24
                  39Parameterized Complexity for the Skeptic Rod Downey School of Mathematical and Computing Sciences Victoria University P. O. Box 600 Wellington, New Zealand

                  Parameterized Complexity for the Skeptic Rod Downey School of Mathematical and Computing Sciences Victoria University P. O. Box 600 Wellington, New Zealand

                  Add to Reading List

                  Source URL: www.mcs.vuw.ac.nz

                  Language: English - Date: 2003-05-01 18:15:50
                    40On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties? Pinar Heggernes1 , Pim van ’t Hof1 , D´aniel Marx2 , Neeldhara Misra3 , and Yngve Villanger1 1

                    On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties? Pinar Heggernes1 , Pim van ’t Hof1 , D´aniel Marx2 , Neeldhara Misra3 , and Yngve Villanger1 1

                    Add to Reading List

                    Source URL: www.cs.bme.hu

                    Language: English - Date: 2012-05-24 07:30:05